Schedulability Tests for Fixed Priority Scheduling
نویسنده
چکیده
Tasks can be classi ed as either periodic which execute every some time units or vice versa as aperiodic. Sporadic tasks are a special case of aperiodic tasks which are guaranteed to have a minimum spacing between consecutive instances of the same task. Sporadic tasks sets can be handled by modeling them as periodic tasks and therefore we will concentrate on the former two types of tasks. Scheduling strategies have two orthogonal classi cations. On one hand
منابع مشابه
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which th...
متن کاملMultiprocessor Schedulability Analysis for Self - Suspending Task Systems ∗
In many real-time systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored and is thought to be difficult (as it is on uniprocessors). In this paper, hard/soft multiprocessor schedulability tests for arbitrary-deadline sporadic self-suspending task systems are presented for both global EDF and ...
متن کاملFPCL and FPZL Schedulability Analysis
This paper presents the Fixed Priority until Critical Laxity (FPCL) and Fixed Priority until Zero Laxity (FPZL) and scheduling algorithms for multiprocessor real-time systems. FPZL is similar to global fixed priority pre-emptive scheduling; however, whenever a task reaches a state of zero laxity it is given the highest priority. FPCL is a variant of FPZL that introduces no additional scheduling...
متن کاملOn Fixed Priority Preemptive Scheduling for Imprecise Computation
We present new results in fixed priority scheduling for imprecise computation in real-time systems. Imprecise computation has not been popularized enough for reasons which are rooted from the task model, scheduling methods (EDF-based) and general system support. Audsley et al. have devised schedulability tests for guaranteeing mandatory computation while incorporating unbounded optional compone...
متن کاملSuspension-Aware Schedulability Analysis for Multiprocessor Embedded Systems
In many embedded systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored. The commonly used suspension-oblivious approach of treating all suspensions as computation can be quite pessimistic. As an alternative, this paper presents the first suspension-aware multiprocessor schedulability analysi...
متن کاملOn Optimal Priority Assignment for Response Time Analysis of Global Fixed Priority Pre-emptive Scheduling in Multiprocessor Hard Real-Time Systems
This paper investigates the problem of optimal priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. Previous work in this area showed that arguably the most effective pseudo-polynomial schedulability tests for global fixed priority pre-emptive scheduling, based on response time analysis, are not compatible with Audsley’s Optimal Priori...
متن کامل